Overworkard Fatigue of the Workers Divided into 3 Groups by 3-Shift System
نویسندگان
چکیده
منابع مشابه
2-recognizability of the simple groups $B_n(3)$ and $C_n(3)$ by prime graph
Let $G$ be a finite group and let $GK(G)$ be the prime graph of $G$. We assume that $ngeqslant 5 $ is an odd number. In this paper, we show that the simple groups $B_n(3)$ and $C_n(3)$ are 2-recognizable by their prime graphs. As consequences of the result, the characterizability of the groups $B_n(3)$ and $C_n(3)$ by their spectra and by the set of orders of maximal abelian subgroups are ...
متن کاملVisual field (Octopus 1-2-3) in normal subjects divided into homogeneous age-groups.
PURPOSE To determine the values in decibels of retinal sensitivity within the central 26 degrees of the visual field of normal subjects divided into homogenous age groups using the Octopus 1-2-3; to compare the values of retinal sensitivity we have found with those considered normal in the statistical package obtained by a multicenter study performed in 1994 with Octopus 201. METHODS 181 subj...
متن کامل2-recognizability of the simple groups $b_n(3)$ and $c_n(3)$ by prime graph
let $g$ be a finite group and let $gk(g)$ be the prime graph of $g$. we assume that $ngeqslant 5 $ is an odd number. in this paper, we show that the simple groups $b_n(3)$ and $c_n(3)$ are 2-recognizable by their prime graphs. as consequences of the result, the characterizability of the groups $b_n(3)$ and $c_n(3)$ by their spectra and by the set of orders of maximal abelian subgroups are obtai...
متن کاملInterindividual differences in circadian fatigue patterns of shift workers.
Ostberg, 0. (1973). BritishJournalofIndustrialMedicine,30,341-351. Interindividual differences in circadian fatigue patterns of shift workers. Data from 37 computer operators and outputhandlers, working on discontinuous 8-16-24 alternating shifts, were collected in the morning, evening, and night shifts during a one-year period. The study was directed to the interindividual diTerences in the wo...
متن کاملquasirecognition by prime graph of finite simple groups ${}^2d_n(3)$
let $g$ be a finite group. in [ghasemabadi et al., characterizations of the simple group ${}^2d_n(3)$ by prime graph and spectrum, monatsh math., 2011] it is proved that if $n$ is odd, then ${}^2d _n(3)$ is recognizable by prime graph and also by element orders. in this paper we prove that if $n$ is even, then $d={}^2d_{n}(3)$ is quasirecognizable by prime graph, i.e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sangyo Igaku
سال: 1960
ISSN: 0047-1879,1881-1302
DOI: 10.1539/joh1959.2.4_369_2